Fast Conflict Detection for Multi-Dimensional Packet Filters

To support advanced network services, Internet routers must perform packet classification based on a set of rules called filters. If two or more filters overlap, filter conflict will occur and lead to ambiguity in classification. Further, it may affect security even the correctness routing. Hence, is necessary detect conflicts avoid above problems. In recent years, many detection algorithms have been proposed, but most them for only prefix fields (i.e., source/destination IP address fields) For greater practicality, include non-prefix such as port protocol field. this study, we propose an efficient algorithm five-dimensional filters, which both fields. proposed algorithm, tiny lookup table created quickly filtering out large portion non-conflicting pairs, thereby reducing overall time. Experimental results show that our reduces time by 10% 28% compared with other 20 K databases. More importantly, can be used extend any existing two-dimensional fast